Optimal blood issuing by comprehensive matching
نویسندگان
چکیده
Mass-scale red blood cell genotyping of donors and transfusion recipients increases the availability extended antigen matched units. Therefore, a new mathematical framework is developed that can be applied for general groups (i.e., beyond ABO, RhD groups). It determines which units should issued from inventory, such requests hospitals satisfied with compatible units, shortages future are avoided, outdating prevented. The optimization model consists two steps: binary vector representation formulation inventory allocation problem as minimum cost flow problem. potential practical performance evaluated by iterative simulations, based on historical data supply demand in Netherlands. When including fourteen clinically most relevant antigens, more than 90% all identical Shortages kept restricted could even reduced to virtually zero, when only considered.
منابع مشابه
Does Reputation Talk? The Matching of Underwriters and Issuing Firms
The purpose of this paper is to examine the role of reputation in the matching of underwriters and issuing firms in the straight corporate bond market in Japan. While the existing literature already investigates how the issuing firm chooses its underwriter at the time of issue, this paper uses initial and seasoned issues of straight corporate bonds to examine how the matching of underwriters an...
متن کاملRegion Matching by Optimal Fuzzy Dissimilarity
To extract region features independent on translation, rotation and scaling of object, a new coordinate system is established. The origin of the new coordinate system can be set at the mass center of the object. The new axis ' x and ' y are based on the main inertia axes. The size of the object can be identified by its minimal constraint rectangle called feature rectangle which has minimal area...
متن کاملOptimal Multi-Scale Matching
The coarse-to-fine search strategy is extensively used in current reported research. However, it has the same problems as any hill climbing algorithm, most importantly, it often finds local instead of global minima. Drawing upon the artificial intelligence literature, we applied an optimal graph search, namely A*, to the problem. Using real stereo and video test sets, we compared the A* method ...
متن کاملAn Optimal Matching Problem
Suppose we are given three goods, X,Y , and Z. They are not homogeneous, but come in different qualities, x ∈ X , y ∈ Y and z ∈ Z. Goods X and Y are used for the sole purpose of producing good Z, which we are interested in. To obtain one piece of good Z, one has to assemble one piece of good X and one piece of good Y . More precisely, one can obtain a piece of quality z by assembling one piece ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2022
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2021.02.054